Cluster head shuffling based global optimization using elephant herd optimization (EHO) approach
نویسندگان
چکیده
منابع مشابه
Honey global supply chain network design using fuzzy optimization approach
From the past, honey has been known as a healthy product for human life. Iran has a suitable climate for beekeeping and is among the high-ranked countries in honey production. However, due to failure to comply with quality issues, export of honey from Iran is associated with many problems. According to this issue, this paper presents a robust possibilistic optimization network design model for ...
متن کاملGlobal Optimization Using Hybrid Approach
The paper deals with a global optimization algorithm using hybrid approach. To take the advantage of global search capability the evolution strategy(ES) with some modifications in recombination is used first to find the near-optimal solutions. The sequential quadratic programming(SQP) is then used to find the exact solution from the solutions found by ES. One merit of the algorithm is that the ...
متن کاملGlobal Optimization using a Dynamical Systems Approach
We develop new algorithms for global optimization by combining well known branch and bound methods with multilevel subdivision techniques for the computation of invariant sets of dynamical systems. The basic idea is to view iteration schemes for local optimization problems — e.g. Newton’s method or conjugate gradient methods — as dynamical systems and to compute set coverings of their fixed poi...
متن کاملA new improved krill herd algorithm for global numerical optimization
This study presents an improved krill herd (IKH) approach to solve global optimization problems. The main improvement pertains to the exchange of information between top krill during motion calculation process to generate better candidate solutions. Furthermore, the proposed IKH method uses a new Lévy flight distribution and elitism scheme to update the KH motion calculation. This novel meta-he...
متن کاملThe cluster problem in multivariate global optimization
We consider branch and bound methods for enclosing all unconstrained global minimizers of a nonconvex nonlinear twice-continuously differentiable objective function. In particular, we consider bounds obtained with interval arithmetic, with the “midpoint test,” but no acceleration procedures. Unless the lower bound is exact, the algorithm without acceleration procedures in general gives an undes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2018
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i2.4.10039